The least eigenvalue of a graph with cut vertices
نویسندگان
چکیده
منابع مشابه
On the Least Eigenvalue of Graphs with Cut Vertices
Let S be a certain set of graphs. A graph is called a minimizing graph in the set S if its least eigenvalue attains the minimum among all graphs in S . In this paper, we determine the unique minimizing graph in Gn, where Gn denotes the set of connected graphs of order n with cut vertices.
متن کاملFinding Cut-Vertices in the Square Roots of a Graph
The square of a given graph H = (V,E) is obtained from H by adding an edge between every two vertices at distance two in H. Given a graph class H, the H-Square Root problem asks for the recognition of the squares of graphs in H. In this paper, we answer positively to an open question of [Golovach et al., IWOCA’16] by showing that the squares of cactus block graphs can be recognized in polynomia...
متن کاملThe Chromatic Number and the Least Eigenvalue of a Graph
In this paper we get a structural property for a graph having the minimal least eigenvalue among all graphs of fixed order and given chromatic number, and characterize such graphs under the condition that the chromatic number is not larger than half the order of the graph. As a result, we obtain a lower bound on the least eigenvalue in terms of the chromatic number, and an upper bound on the ch...
متن کاملOn the Second Least Distance Eigenvalue of a Graph
Let G be a connected graph on n vertices, and let D(G) be the distance matrix of G. Let ∂1(G) ≥ ∂2(G) ≥ · · · ≥ ∂n(G) denote the eigenvalues of D(G). In this paper, the connected graphs with ∂n−1(G) at least the smallest root of x3 − 3x2 − 11x− 6 = 0 are determined. Additionally, some non-isomorphic distance cospectral graphs are given.
متن کاملBlocks and Cut Vertices of the Buneman Graph
Given a set Σ of bipartitions of some finite set X of cardinality at least 2, one can associate to Σ a canonical X-labeled graph B(Σ), called the Buneman graph. This graph has several interesting mathematical properties — for example, it is a median network and therefore an isometric subgraph of a hypercube. It is commonly used as a tool in studies of DNA sequences gathered from populations. In...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 2010
ISSN: 0024-3795
DOI: 10.1016/j.laa.2010.01.030